Fast subsequence matching in time-series databases
نویسندگان
چکیده
منابع مشابه
Ranked Subsequence Matching in Time-Series Databases
Existing work on similar sequence matching has focused on either whole matching or range subsequence matching. In this paper, we present novel methods for ranked subsequence matching under time warping, which finds top-k subsequences most similar to a query sequence from data sequences. To the best of our knowledge, this is the first and most sophisticated subsequence matching solution mentione...
متن کاملDuality-Based Subsequence Matching in Time-Series Databases
In this papec we propose a new subsequence matching method, DualMatch, which exploits duality in constructing windows and significantly improves performance. Qual Match divides data sequences into disjoint windows and the query sequence into sliding windows, and thus, is a dual approach of the one by Faloutsos et al. (FRM in short), which divides data sequences into sliding windows and the quer...
متن کاملLinear Detrending Subsequence Matching in Time-Series Databases
Each time-series has its own linear trend, the directionality of a timeseries, and removing the linear trend is crucial to get the more intuitive matching results. Supporting the linear detrending in subsequence matching is a challenging problem due to a huge number of possible subsequences. In this paper we define this problem the linear detrending subsequence matching and propose its efficien...
متن کاملSimilar Subsequence Search in Time Series Databases
Finding matching subsequences in time series data is an important problem. The classical approach to search for matching subsequences has been on the principle of exhaustive search, where all possible candidates are generated and evaluated or all the terms of the time series in a data base are examined. As a result most of the subsequence search algorithms are cubic in nature with few algorithm...
متن کاملEfficient Subsequence Matching in Time Series Databases Under Time and Amplitude Transformations
Subsequence matching in large time series databases has attracted a lot of interest and many methods have been proposed that cope with this problem in an adequate extend. However, locating subsequence matches of arbitrary length, under time and amplitude transformations, has received far less attention and is still an open problem. The importance of this problem lies in the fact that many time ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMOD Record
سال: 1994
ISSN: 0163-5808
DOI: 10.1145/191843.191925